A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
نویسندگان
چکیده
We consider the problem of minimizing the makespan when scheduling tasks on two uniform parallel machines, where one machine is q times as efficient on each task as is the other. We compute the maximum relative error of the LPT (largest processing time first) heuristic as an explicit function of q. In the special case that the two machines are identical (q = 1), our problem and heuristic reduce to the problem and heuristic analyzed by Graham (1969).
منابع مشابه
A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
We propose a modified longest processing time (MLPT) heuristic algorithm for the two uniform machine makespan minimization problem. The MLPT algorithm schedules the three longest jobs optimally first, followed by the remaining jobs sequenced according to the LPT rule. We prove the tight worst-case ratio bound of ffiffiffiffiffiffi 1:5 p 1⁄4 1:2247 for the MLPT algorithm which is an improvement ...
متن کاملThe Worst-case Analysis of the MULTIFIT Algorithm for Scheduling Nonsimultaneous Parallel Machines
In this paper we consider the nonsimultaneous multiprocessor scheduling problem, or NMSP for short. The NMSP is a makespan minimization scheduling problem which involves the nonpreemptive assignment of independent jobs on m parallel machines with di erent starting times. It is well known that the longest processing time (LPT) algorithm and the modi ed LPT(MLPT) algorithm yield schedules with ma...
متن کاملComparing the minimum completion times of two longest-first scheduling-heuristics
For the problem of non-preemptively scheduling n independent jobs on m identical parallel machines so that the minimum (or earliest) machine completion time is maximized, we compare two well-known longest-first heuristics the LPT(longest processing time) and the RLPT-heuristic (restricted LPT). We prove that the minimum completion time of the LPT-schedule is at least as long as the minimum comp...
متن کاملParallel Machines Scheduling with Machine Shutdowns
we study the nonpreemptive parallel machines scheduling problem where some of the machines are planned to be shutdown. We apply LPT algorithm to the problem and analyze its performance. Our analysis shows that the makespan of the LPT schedule is bounded by twice the optimum makespan if no more than half of the machines are allowed to be shutdown simultaneously. We also show that this bound ls t...
متن کاملAn improved delayed-start LPT algorithm for a partition problem on two identical parallel machines
We propose an off-line delayed-start LPT algorithm that sequences the first (longest) 5 jobs optimally and the remaining jobs according to the LPT principle on two identical parallel machines. We show that this algorithm has a sharper tight worst-case ratio bound than the traditional LPT algorithm for the sum of squares of machine completion times minimization problem. 2007 Elsevier B.V. All ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 45 شماره
صفحات -
تاریخ انتشار 1997